Generating linear spans over finite fields by Wun - Seng Chou ( Taipei ) and Gary
نویسندگان
چکیده
(1) sk = { vk if k ≤ n , ∑n−1 i=0 aisk−n+i if k > n , consists of all nonzero elements of V for k = 1, . . . , p − 1. Such generating patterns are of interest because they provide simple algorithms for generating the linear span of independent subsets of vector spaces over Fp (see [1] for details). In this paper we generalize a number of the results from [1] by working over Fq where Fq is the finite field of order q and by showing that if a0 6= 0, (a0, . . . , an−1) is an n-dimensional generating pattern over Fq if and only if f(x) = x − ∑n−1 i=0 aix i is a primitive polynomial over Fq. More generally, we show that the number of distinct elements generated by a linear recurring sequence is related to the order of its characteristic polynomial. For q = p < 10 with p ≤ 97, we indicate when one can find an optimal n-dimensional generating pattern over Fp with weight two, i.e. with two nonzero ai’s (in [1] the length is defined to be the number of nonzero ai’s but a more natural term is Hamming weight). If V is an n-dimensional vector space over Fq then V is isomorphic to Fqn as a vector space over Fq. Consequently, instead of considering vectors in V as in [1], we may assume that the elements of the sequence are in Fqn . We will make this identification throughout the remainder of the paper.
منابع مشابه
The Period Lengths of Inversive Congruential Recursions
They used this method as a nonlinear method to generate pseudorandom numbers. Niederreiter [10] generalized it over arbitrary finite field GF(q) when he studied pseudorandom vectors. See also Eichenauer-Herrmann [5] and Niederreiter [11, Chapters 8 and 10] and [12] for more details on these methods. Because the recursion (1) is used to construct pseudorandom numbers and pseudorandom vectors, th...
متن کاملClassical Wavelet Transforms over Finite Fields
This article introduces a systematic study for computational aspects of classical wavelet transforms over finite fields using tools from computational harmonic analysis and also theoretical linear algebra. We present a concrete formulation for the Frobenius norm of the classical wavelet transforms over finite fields. It is shown that each vector defined over a finite field can be represented as...
متن کاملClassical wavelet systems over finite fields
This article presents an analytic approach to study admissibility conditions related to classical full wavelet systems over finite fields using tools from computational harmonic analysis and theoretical linear algebra. It is shown that for a large class of non-zero window signals (wavelets), the generated classical full wavelet systems constitute a frame whose canonical dual are classical full ...
متن کاملOn the partition function of a finite set
Let A = {a1, a2, . . . , ak} be a set of k relatively prime positive integers. Let p A (n) denote the partition function of n with parts in A, that is, p A is the number of partitions of n with parts belonging to A. We survey some known results on p A (n) for general k, and then concentrate on the cases k = 2 (where the exact value of p A (n) is known for all n), and the more interesting case k...
متن کامل